Anycast Cloud Routing for Wireless Networks

نویسندگان

  • Daniel Havey
  • Roman Chertov
  • Kevin Almeroth
چکیده

To cope with unpredictable packet losses caused by the wireless environment there exist techniques using route selection, retransmission, and buffering. This can make losses incurred over a one or two hop path acceptable. However, as the number of hops in the path increases to three, four, and beyond packet losses inexorably add up and exceed the limits of these techniques. This can cause unacceptable interruptions in content delivery and make it impossible to meet service level agreements. In a wireless cloud with multiple entry points an incorrect entry point selection can result in unnecessary additional hops causing unacceptable interruption of service. Addressing this problem in this work we present an anycast entry point selection technique that minimizes hop count in a wireless cloud through intelligent selection of entry points into the cloud.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling and Analyzing Anycast and Geocast Routing in Wireless Mesh Networks

Wireless technology has become an essential part of this era’s human life and has the capability of connecting virtually to any place within the universe. A mesh network is a self healing wireless network, built through a number of distributed and redundant nodes to support variety of applications and provide reliability. Similarly, anycasting is an important service that might be used for a va...

متن کامل

Anycast-Based Routing Scheme with Restricted Flooding for Wireless Sensor Networks

An improved method of dynamic route establishment between sensors and sinks is proposed for wireless sensor networks. The method is based on the use of an anycast-based restricted flooding technique and does not require the accumulation and maintenance of state information in network nodes. The proposed scheme is implemented as a simulation model in terms of extended Petri nets. The developed m...

متن کامل

Anycast Routing in Wireless Sensor Networks

Anycast is a mechanism that it sends the data groups to the nearest interface during which they have the same anycast address. Ant colony system, a population-based algorithm, provides natural and intrinsic way of exploration of search space in optimization settings in determining optimal anycast tree. In this paper, we propose a sink selection heuristic algorithm called Minimum Ant-based Data ...

متن کامل

Improving Performance of Wireless Networks Using Anycast

Kim, Joohwan Ph.D., Purdue University, May 2010. Improving Performance of Wireless Networks Using Anycast. Major Professors: Ness B. Shroff and Xiaojun Lin. The wireless medium is characterized by a highly variable and unreliable environment that could lead to performance degradation in wireless systems, such as large delays, high energy consumption, and low throughput. In this thesis, we are i...

متن کامل

PWave: A Multi-source Multi-sink Anycast Routing Framework for Wireless Sensor Networks

We propose a novel routing framework called PWave that supports multi-source multi-sink anycast routing for wireless sensor networks. A distributed and scalable potential field estimation algorithm and a probabilistic forwarding scheme are proposed to ensure low overhead and high resilience to network dynamics. Key properties of this framework are proved through theoretical analysis and verifie...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010